منابع مشابه
Real-Time Optimization for Kites
Over the past decade, a large number of academics and start-ups have devoted themselves to developing kites as a renewable energy source. Determining the trajectories the kite should follow is a modeling and optimization challenge. We present a dynamic model and analyse how uncertainty affects the resulting optimization problem. We show how measurements can be used to rapidly correct the model-...
متن کاملFuzzy Real-Time Optimization of the Tennessee Eastman Challenge Process
A Real-Time Optimization (RTO) strategy incorporating the fuzzy sets theory is developed, where the problem constraints obtained from process considerations are treated in fuzzy environment. Furthermore, the objective function is penalized by a fuzzified form of the key process constraints. To enable using conventional optimization techniques, the resulting fuzzy optimization problem is the...
متن کاملOptimization of Real Time PCR for Precise Measurement of HER2 Overexpression in Breast Cancer Specimens
Background: Breast cancer is one of the most prevalent malignancies among women in various countries. HER2 overexpression, which is due to different reasons, occurs in 20-30% of breast cancers. HER2 gene encodes an 185kDa transmembrane glycoprotein with 1255 amino acids. This active product triggers downstream intracellular signaling pathways inducing cell proliferation and cell survival. These...
متن کاملReal-Time Convex Optimization
This chapter concerns the use of convex optimization in real-time embedded systems, in areas such as signal processing, automatic control, real-time estimation , real-time resource allocation and decision making, and fast automated trading. By 'embedded' we mean that the optimization algorithm is part of a larger, fully automated system, that executes automatically with newly arriving data or c...
متن کاملOptimization in Real Time
In this paper, we present a search algorithm called real-time search for solving combinatorial optimization problems under real-time constraints. The problems we study are NP-hard and have good heuristic algorithms for generating feasible solutions. The algorithm we develop aims at finding the best possible solution in a given deadline. Since this objective is generally not achievable without f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2013
ISSN: 1474-6670
DOI: 10.3182/20130703-3-fr-4039.00004